i-Code: A New Approach to Practical Network Coding for Content Distribution
نویسندگان
چکیده
This paper studies the practicality of network coding to facilitate cooperative content distribution. Network coding is a new data transmission technique which allows any nodes in a network to encode and distribute data. It is a good solution offering reliability and efficiency in distributing content, but network coding has not been widely used because of its dubious performance gains and coding overhead in practice. With the implementation of network coding in a real-world application, this paper measures the performance and overhead of network coding for content distribution in practice. This study also provides a lightweight yet efficient encoding scheme which allows network coding to provide improved performance and robustness with negligible overhead.
منابع مشابه
Robust Distributed Source Coding with Arbitrary Number of Encoders and Practical Code Design Technique
The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...
متن کاملNetwork Coding and its Applications in Communication Networks
The network coding technique generalizes the traditional routing approach by allowing the intermediate network nodes to create new packets by combining the packets received over their incoming edges. This technique has several important benefits such as an increase in throughput and an improvement in the reliability and robustness of the network. The goal of this chapter is to present a tutoria...
متن کاملA New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks
The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملA Suitable Coding Scheme for Broadband Power-line Communication
This paper introduces three coding strategies for using the Luby Transform (LT) code in a relay aided power-line communication scheme. In the first method, the relay decodes the received packets and re-encodes them for transmission towards the destination. In the second method, the relay only forwardes a random linear combination of its received packets towards the destination, while in the thi...
متن کامل